On LL-regular grammars

On the Parsing of LL-Regular Grammars

The Equivalence Problem for LL - and L / ? - Regular Grammars

The equivalence problem for context-free grammars is “given two arbitrary grammars, do they generate the same language ?” Since this is undecidable in general attention has been restricted to decidable subclasses of the context-free grammars. For example, the classes of U(k) grammars and real-time strict deterministic grammars. In this paper it is shown that the equivalence problem for U-regula...

The Equivalence Problem for LL- and LR-Regular Grammars

Questions whether or not two grammars belonging to a family of grammars generate the same language have extensively been studied in the literature. These problems are called equivalence problems and if there exists an algorithm which for each pair of grammars of this family gives an answer to this question then the equivalence problem for this family of grammars is said to be decidable. Otherwi...

From LL-Regular to LL (1) Grammars: Transformations, Covers and Parsing

— In this paper it is shown that it is possible to transform any LL-regular grammar G into an LL{\) grammar G' in such a way that parsing G' is as good as parsing G. That ist a par se of a sentence of grammar G can be obtained with a simple string homomorphism from the parse of a corresponding sentence of G'. Since any LL (k) grammar is an LL-regular grammar the results which are obtained are v...

On fuzzy multiset regular grammars

The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...